Solving logistic tasks by parallelizing algorithms of the theory of direct decompositions of torsion-free abelian groups

The paper considers the principles of parallelization at marshalling yards and determines their importance. There are presented methods for direct decompositions torsion-free Abelian groups finite rank. applied concepts “conditionally linear graphs” depicting railway trains characteristics, including “quasi-length”, which characterizes length corresponding “quasi-graph”. has been formalized a graphical approach to redistribution railcars incoming yard formation outgoing trains. algorithms have developed.